IPSI-PF - A business process matchmaking engine based on annotated finite state automata

نویسندگان

  • Andreas Wombacher
  • Bendick Mahleko
  • Erich J. Neuhold
چکیده

Success of Web services mainly depends on the availability of tools facilitating usage of technology within the addressed B2B integration problems. One severe problem in loosely coupled systems is service discovery including a sufficient matchmaking definition. The concept for service discovery in web service architecture is UDDI providing limited querying functionality and not being capable to deal with the multiple dimensions of a service, like for example semantic, workflow, or Quality of Service aspects. The IPSI Process Finder (IPSI-PF) realizes service discovery by extending the capabilities of UDDI by matchmaking of service descriptions. The extension is realized such that an integration of additional extensions can be added quite easily.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matchmaking for Business Processes Based on Choreographies

Web services have a potential to enhance B2B e-commerce over the Internet by allowing companies and organizations to publish their business processes on service directories where potential trading partners can find them. This can give rise to new business paradigms based on ad-hoc trading relations as companies, particularly small to medium scale, can cheaply and flexibly enter into fruitful co...

متن کامل

Efficient matchmaking of business processes in web service infrastructures

The problem addressed in this dissertation can be stated as follows: given as a query, a business process description within a Web service infrastructure, ef ciently nd business processes from a large repository that complementarily support the input query. In particular, the input business process enforces that some parts of the business process be mandatory. For example, a buyer organization ...

متن کامل

Finite State Automata Semantics in Communicating Sequential Processes

MOTIVATION Traditionally, distributed systems and protocols are described with finite state automata (finite state machines). As result of that, many tools based on finite state automata have been developed and used. Such an example is business state machines used in IBM WebSphere Integration Developer [1]. Later on, other more powerful mathematical tools for specification and analyses of distr...

متن کامل

An Empirical Evaluation of Multidimensional Matchmaking

An electronic negotiation is a request-and-offer based communication process between agents in a market aiming at an agreement for a mutual consent deal. The process breaks in several phases, one of which is matchmaking. Matchmaking includes the determination of the relevance of a specific offer for a request. This process is used (i) to find out which offering agents do fit the request best; a...

متن کامل

Semantic Matchmaking via Non-Monotonic Reasoning: the MaMaS-tng Matchmaking Engine

In a semantic Web service (SWS) matchmaking process, given a request, it is obvious that not only a list of services should be returned, but also a ranking of compatible SWSs should be provided. Obviously having semantically annotated services, the ranking should be based evaluating semantic similarity between descriptions. Furthermore, the availability of such descriptions makes explanation of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Inf. Syst. E-Business Management

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2005